Extended ACO Algorithm for Path Prioritization
نویسندگان
چکیده
منابع مشابه
A Novel Aco-Based Multicast Path Algorithm In Hypercube Networks
This paper proposes an ACO (ant colony optimization)-based multicast path algorithm (AMPA) to reduce the multicast communication traffic in hypercube networks. According to the high regularity of hypercube networks, an optimized distributed algorithm (Opt-AMPA) for AMPA is proposed by clustering strategy, whose time cost can fill the requirements of the actual networks. The simulation results i...
متن کاملSolving Path Planning Problem by an ACO-PSO Hybrid Algorithm
An ACO-PSO Hybrid Algorithm Solving Path Planning Problem based on Swarm Intelligence (SI) is proposed. The problem first is described and some corresponding definitions are presented. Ant colony optimization (ACO) is used to establish the corresponding solution, and some material algorithm steps are set out. Particle swarm optimization (PSO) is applied to optimize the parameters in ACO, and pa...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملHybrid Aco-pso for Robotic Path Planning
In the context of robotic path planning, a common strategy is to assume that the world is static and believed on heuristic approaches and obstacle avoidance to deal with changes in the environment. When planning is not considered for potential changes of the environment into account usually leads to poor performances. In this paper, we propose a hybrid ACO-PSO approach that exploits the travers...
متن کاملAn ACO algorithm for image compression
This paper is an application of Ant Colony Metaheuristic (ACO) to the problem of image fractal compression using IFS. An ACO hybrid algorithm is proposed for image fractal compression and the results obtained are shown. According to the tests carried out, the proposed algorithm offers images with similar quality to that obtained with a deterministic method, in about 34% less time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/11359-6582